Multi-coloring Trees
نویسندگان
چکیده
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, while in the non-preemptive case, the set of colors assigned to each vertex has to be contiguous. We study these versions of the multicoloring problem on trees, under the sum-of-completiontimes objective. In particular, we give a quadratic algorithm for the non-preemptive case, and a faster algorithm in the case that all job lengths are short, while we present a polynomialtime approximation scheme for the preemptive case.
منابع مشابه
A Linear Algorithm for Finding Total Colorings of Partial k-Trees
A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, in such a way that no two adjacent or incident elements receive the same color. The total coloring problem is to find a total coloring of a given graph with the minimum number of colors. Many combinatorial problems can be efficiently solved for partial k-trees, i.e., graphs with bounded tree-width. Howeve...
متن کاملON VERTEX b-CRITICAL TREES
A b-coloring is a proper coloring of the vertices of a graph such that each color class has a vertex that has neighbors of all other colors. The b-chromatic number of a graph G is the largest k such that G admits a b-coloring with k colors. A graph G is b-critical if the removal of any vertex of G decreases the b-chromatic number. We prove various properties of b-critical trees. In particular, ...
متن کاملConflict-free Coloring for Connected Subgraphs of Trees and Trees of Rings
We introduce the Connected-Subgraphs Conflict-Free Coloring problem which has applications to frequency assignment in cellular networks: given a graph, assign a minimum number of colors to its vertices in such a way that each connected subgraph contains a vertex with a color that is unique among the colors of all other vertices in that subgraph. We propose an algorithm that achieves an optimal ...
متن کاملThe permutation-path coloring problem on trees
In this paper we rst show that the permutation-path coloring problem is NP-hard even for very restrictive instances like involutions, which are permutations that contain only cycles of length at most two, on both binary trees and on trees having only two vertices with degree greater than two, and for circular permutations which are permutations that contain exactly one cycle on trees with maxim...
متن کاملOn coloring problems with local constraints
We show complexity results for some generalizations of the graph coloring problem on two classes of perfect graphs, namely clique trees and unit interval graphs. We deal with the μ-coloring problem (upper bounds for the color on each vertex), the precoloring extension problem (a subset of vertices colored beforehand), and a problem generalizing both of them, the (γ, μ)-coloring problem (lower a...
متن کاملSymmetry Breaking in Trees and Planar Graphs by Vertex Coloring
An undirected graph G is said to be d-distinguishable if there is a d-coloring of its vertex set V (G) such that no nontrivial automorphism of G preserves the coloring. The distinguishing number of a graph G is the minimum d for which it is d-distinguishable. In this paper we design efficient algorithms for computing the distinguishing numbers of trees and planar graphs.
متن کامل